Restricted non-separable planar maps and some pattern avoiding permutations

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Restricted rooted non-separable planar maps

Tutte founded the theory of enumeration of planar maps in a series of papers in the 1960s. Rooted non-separable planar maps have connections, for example, to pattern-avoiding permutations, and they are in one-to-one correspondence with the β(1, 0)-trees introduced by Cori, Jacquard and Schaeffer in 1997. In this paper we enumerate 2-face-free rooted non-separable planar maps and obtain restrict...

متن کامل

Some equinumerous pattern-avoiding classes of permutations

Suppose that p, q, r, s are non-negative integers with m = p+ q+ r+ s. The class X(p, q, r, s) of permutations that contain no pattern of the formαβγ where |α| = r, |γ| = s and β is any arrangement of {1, 2, . . . , p}∪{m−q+1,m− q+2, . . . ,m} is considered. A recurrence relation to enumerate the permutations of X(p, q, r, s) is established. The method of proof also shows that X(p, q, r, s) = X...

متن کامل

Restricted 132-avoiding permutations

We study generating functions for the number of permutations on n letters avoiding 132 and an arbitrary permutation τ on k letters, or containing τ exactly once. In several interesting cases the generating function depends only on k and is expressed via Chebyshev polynomials of the second kind. 2000 Mathematics Subject Classification: Primary 05A05, 05A15; Secondary 30B70, 42C05

متن کامل

Alternating, Pattern-Avoiding Permutations

We study the problem of counting alternating permutations avoiding collections of permutation patterns including 132. We construct a bijection between the set Sn(132) of 132-avoiding permutations and the set A2n+1(132) of alternating, 132avoiding permutations. For every set p1, . . . , pk of patterns and certain related patterns q1, . . . , qk, our bijection restricts to a bijection between Sn(...

متن کامل

Pattern Avoiding Permutations

We establish a bijection from the set of all permutations (of a given length) that avoid a pattern q and a context-sensitive language.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Applied Mathematics

سال: 2013

ISSN: 0166-218X

DOI: 10.1016/j.dam.2013.01.004